THE NUMBER OF NEIGHBOURLY ^-POLYTOPES WITH d+3 VERTICES
نویسنده
چکیده
§
منابع مشابه
THE NUMBER OF SIMPLICIAL NEIGHBOURLY d-POLYTOPES WITH d+3 VERTICES
In this paper is proved a formula for the number of simplicial neighbourly d-polytopes with d + 3 vertices, when d is odd. §
متن کاملEdge Expansion of Cubical Complexes
In this paper we show that graphs of “neighbourly” cubical complexes – cubical complexes in which every pair of vertices spans a (unique) cube – have good expansion properties, using a technique based on multicommodity flows. By showing that graphs of stable set polytopes are graphs of neighbourly cubical complexes we give a new proof that graphs of stable set polytopes have edge expansion 1.
متن کاملOn Counting the k-face Cells of Cyclic Arrangements
A projective d-arrangement of n hyperplanes H(d, n) is a finite collection of hyperplanes in the real projective space Pd such that no point belongs to every hyperplane of H(d, n). Any arrangement H(d, n) decomposes Pd into a d-dimensional cell complex K . We may call cells of H(d, n) the d-cells of K , and facets of H(d, n) the (d − 1)-cells of K . Clearly any cell of H(d, n) has at least (res...
متن کاملMaximal f-vectors of Minkowski sums of large numbers of polytopes
It is known that in the Minkowski sum of r polytopes in dimension d, with r < d, the number of vertices of the sum can potentially be as high as the product of the number of vertices in each summand [2]. However, the number of vertices for sums of more polytopes was unknown so far. In this paper, we study sums of polytopes in general orientations, and show a linear relation between the number o...
متن کاملSome bounds on chromatic number of NI graphs
A connected graph is called neighbourly irregular (NI) if it contains no edge between the vertices of the same degree. In this paper we determine the upper bound for chromatic number of a neighbourly irregular graph. We also prove some results on neighbourly irregular graphs and its chromatic number.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009